Strongly regular graphs with non-trivial automorphisms
نویسندگان
چکیده
منابع مشابه
On the Automorphism Groups of Strongly Regular Graphs II
We derive strong constraints on the automorphism groups of strongly regular (SR) graphs, resolving old problems motivated by Peter Cameron’s 1981 description of large primitive groups. Trivial SR graphs are the disjoint unions of cliques of equal size and their complements. Graphic SR graphs are the line-graphs of cliques and of regular bipartite cliques (complete bipartite graphs with equal pa...
متن کاملOn the asymmetry of random regular graphs and random graphs
This paper studies the symmetry of random regular graphs and random graphs. Our main result shows that for all 3 ≤ d ≤ n − 4 the random d-regular graph on n vertices almost surely has no non-trivial automorphisms. This answers an open question of N. Wormald [13].
متن کاملOn Automorphisms of Strongly Regular Graphs
A strongly regular graph with λ = 0 and μ = 3 is of degree 3 or 21. The automorphisms of prime order and the subgraphs of their fixed points are described for a strongly regular graph Γ with parameters (162, 21, 0, 3). In particular, the inequality |G/O(G)| ≤ 2 holds true for G = Aut(Γ).
متن کاملSymplectic graphs and their automorphisms
The general symplectic graph Sp(2ν, q) is introduced. It is shown that Sp(2ν, q) is strongly regular. Its parameters are computed, its chromatic number and group of graph automorphisms are also determined.
متن کاملA Conference in Celebration of Peter Cameron
s (updated 09 July 2013) Queen Mary, University of London, 8th – 10th July 2013 László Babai (University of Chicago, USA.) Symmetry Versus Regularity. The theme of this talk is the long-recognised seeming paradox that regularity constraints often impose severe limitations on the number and structure of symmetries, the archetype of such results being the fact that doubly transitive permutation g...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 311 شماره
صفحات -
تاریخ انتشار 2011